Message Transmission over Classical Quantum Channels with a Jammer with Side Information: Message Transmission Capacity and Resources
نویسندگان
چکیده
In this paper we propose a new model for arbitrarily varying classical-quantum channels. In this model a jammer has side information. We consider two scenarios. In the first scenario the jammer knows the channel input, while in the second scenario the jammer knows both the channel input and the message. The transmitter and receiver share a secret random key with a vanishing key rate. We determine the capacity for both average and maximum error criteria for both scenarios. We also establish the strong converse. We show that all these corresponding capacities are equal, which means that additionally revealing the message to the jammer does not change the capacity. ar X iv :1 80 1. 10 55 0v 1 [ cs .I T ] 3 1 Ja n 20 18
منابع مشابه
Quantum and classical message identification via quantum channels
We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical–quantum (cq) channels and “quantum fingerprinting”. We show that the identification capacity of a discrete memoryless quantum channel for classical information can be larger than that for transmission; this is ...
متن کاملClassical-Quantum Arbitrarily Varying Wiretap Channel
The arbitrarily varying channel models transmission over a channel with an state that can change over time. We may interpret it as a channel with an evil jammer. The arbitrarily varying channel was first introduced by Blackwell, Breiman, and Thomasian in [8]. The wiretap channel models communication with security. It was first introduced by Wyner in [12]. We may interpret it as a channel with a...
متن کاملEntanglement-assisted classical capacities of compound and arbitrarily varying quantum channels
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In this way, we obtain single-letter characterizations of the entanglement-assisted classical capacities for both channel models. Moreover, we show that the ent...
متن کاملPerformance Study of Untrusted Relay Network Utilizing Cooperative Jammer
Abstract—In this paper, the problem of secure transmission in two-hop amplify-and-forward (AF) systems with an untrusted relay is investigated. To prevent the untrusted relay from intercepting the source message and to achieve positive secrecy rate, the destination-based cooperative jamming (DBCJ) technique is used. In this method the destination sends an intended jamming signal to the relay. T...
متن کاملUniversal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
We consider the compound memoryless quantummultiple-access channel (QMAC) with two sending terminals. In this model, the transmission is governed by the memoryless extensions of a completely positive and trace preserving map which can be any element of a prescribed set of possible maps. We study a communication scenario, where one of the senders shares classical message transmission goals with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1801.10550 شماره
صفحات -
تاریخ انتشار 2018